An Efficient APSP Algorithm
نویسندگان
چکیده
In many cases, recursion removal improves the efficiency of recursive algorithms, especially algorithms with large formal parameters, such as All Pair Shortest path (APSP) algorithms. In this article, a recursion removal of the Seidel’s APSP [14] is presented, and a general method of recursion removal, called stack indexation is introduced.
منابع مشابه
SPLZ: An Efficient Algorithm for Single Source Shortest Path Problem Using Compression Method
Efficient solution of the single source shortest path (SSSP) problem on road networks is an important requirement for numerous real-world applications. This paper introduces an algorithm for the SSSP problem using compression method. Owning to precomputing and storing all-pairs shortest path (APSP), the process of solving SSSP problem is a simple lookup of a little data from precomputed APSP an...
متن کاملNew Parameterized Algorithms for APSP in Directed Graphs
All Pairs Shortest Path (APSP) is a classic problem in graph theory. While for general weighted graphs there is no algorithm that computes APSP in O(n3−ε) time (ε > 0), by using fast matrix multiplication algorithms, we can compute APSP in O(n logn) time (ω < 2.373) for undirected unweighted graphs, and in O(n2.5302) time for directed unweighted graphs. In the current state of matters, there is...
متن کاملAll-Pairs-Shortest-Paths in Spark
We propose an algorithm for the All-Pairs-Shortest-Paths (APSP) problem suitable for implementation in Spark, and analyze its performance. We begin by considering distributed Floyd-Warshall, as proposed by Kumar and Singh (1991). Distributed Floyd-Warshall has asymptotically optimal scaling and can be implemented in Spark by using BlockMatrix to represent the APSP distance matrix. However, we o...
متن کاملCombining Shortest Paths, Bottleneck Paths and Matrix Multiplication
We provide a formal mathematical definition of the Shortest Paths for All Flows (SP-AF) problem and provide many efficient algorithms. The SP-AF problem combines the well known Shortest Paths (SP) and Bottleneck Paths (BP) problems, and can be solved by utilising matrix multiplication. Thus in our research of the SP-AF problem, we also make a series of contributions to the underlying topics of ...
متن کاملEfficient algorithms on sets of permutations, dominance, and real-weighted APSP
Sets of permutations play an important role in the design of some efficient algorithms. In this paper we design two algorithms that manipulate sets of permutations. Both algorithms, each solving a different problem, use fast matrix multiplication techniques to achieve a significant improvement in the running time over the naive solutions. For a set of permutations P ⊂ Sn we say that i k-dominat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004